Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures
نویسندگان
چکیده
We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing algorithm with improved stabilization time complexity and fault-containment features. As a case study, a self-stabilizing spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity.
منابع مشابه
Empire of Colonies: Self-stabilizing and Self-organizing Distributed Algorithms
Self-stabilization ensures automatic recovery from an arbitrary state; we define self-organization as a property of algorithms which display local attributes. More precisely, we say that an algorithm is self-organizing if (1) it converges in sublinear time and (2) reacts “fast” to topology changes. If s(n) is an upper bound on the convergence time and d(n) is an upper bound on the convergence t...
متن کاملEfficient Self-stabilizing Algorithms for Tree Networks
Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(n3 + n2 · ch) moves, where n is the number of nodes in the network and ch is the highest initial value of a variable....
متن کاملTime- and space-efficient self-stabilizing algorithms
In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Self-stabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A self-stabilizing algor...
متن کاملMethods of Hierarchical Clustering
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we describe a recently developed very efficient (linear time) hierarchical clustering...
متن کاملLinear-time Self-stabilizing Byzantine Clock Synchronization
Clock synchronization is a very fundamental task in distributed system. It thus makes sense to require an underlying clock synchronization mechanism to be highly fault-tolerant. A self-stabilizing algorithm seeks to attain synchronization once lost; a Byzantine algorithm assumes synchronization is never lost and focuses on containing the influence of the permanent presence of faulty nodes. Ther...
متن کامل